λ¬Έμ
BOJ - μνΈ
π Logic
for (int i = 0; i < N; i++) {
if (S == 0) break;
int maxIdx = findMax(i, i + S);
for (int j = maxIdx; j > i; j--) {
swap(j - 1, j);
S--;
}
}
S κ° 0μ΄ λλ©΄ μ’
λ£λλ λ°λ³΅λ¬Έ
S λ μ€μμ΄ κ°λ₯ν λ²μλ₯Ό μλ―Ένκ³ , μ΄ λ²μ λ΄μ μ΅λκ°μ μ°Ύκ³ , κ·ΈκΉμ§ μ€μμ λ°λ³΅νλ€.
private static int findMax(int s, int e) {
int maxIdx = 0;
int max = 0;
for (int i = s; i <= e && i < numbers.length; i++) {
if (max < numbers[i]) {
maxIdx = i;
max = numbers[i];
}
}
return maxIdx;
}
- λ²μ λ΄μ μ΅λκ°μ μ°Ύμ κ·Έ μμΉλ₯Ό λ°ννλ€.
π CODE
μ½λ 보기/μ κΈ°π«
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
static int[] numbers;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
numbers = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
int S = Integer.parseInt(br.readLine());
for (int i = 0; i < N; i++) {
if (S == 0) break;
int maxIdx = findMax(i, i + S);
for (int j = maxIdx; j > i; j--) {
swap(j - 1, j);
S--;
}
}
for (int n : numbers)
System.out.print(n + " ");
}
private static int findMax(int s, int e) {
int maxIdx = 0;
int max = 0;
for (int i = s; i <= e && i < numbers.length; i++) {
if (max < numbers[i]) {
maxIdx = i;
max = numbers[i];
}
}
return maxIdx;
}
private static void swap(int i1, int i2) {
int tmp = numbers[i1];
numbers[i1] = numbers[i2];
numbers[i2] = tmp;
}
}
βοΈ Review
- λ¬Έμ μ체λ μ¬μ μΌλ, κ³μ
ArrayIndexOutOfBounds κ° λ μ νλ Έλ€.
- μ
λ ₯ λ²μλ₯Ό νμΈν΄λ³΄λ
N λ³΄λ€ S κ° ν΄ μ μμ΄ λΉμ°νκ²λ λ²μλ₯Ό λμ΄κ°λ κ²½μ°κ° λ°μν μ μμλ€.